Conquering non-isomorphism

Syntactic isomorphism and non-isomorphism under ellipsis

Rooth (1992) and Fiengo and May (1994) argue that elliptical structures are subject to both a semantic and a syntactic parallelism requirement. Pseudosluicing, where an elliptical cleft takes a non-cleft as its antecedent, pose a problem for the idea that there is a syntactic parallelism requirement. In this talk, we will look at Spanish data (building on the analysis of Rodrigues et al. 2008) ...

Conquering Neutrophils

Neutrophils are the most abundant innate immune cells, making up 50%–70% of all leukocytes. Neutrophils are the “first responders” of host defense, preventing infections by deploying sophisticated antimicrobial strategies acting in concert. As neutrophils are short-living cells, they are continuously produced and released from the bone marrow in abundance (>10 per day). Circulating neutrophils ...

Non determinism through type isomorphism

Several non-deterministic extensions to the λ -calculus have been proposed, e.g. [6, 7, 10–12, 24]. In these approaches, the parallel composition (sometimes called the must-convergent parallel composition) is such that if r and s are two λ -terms, the term r+ s (also written r ‖ s) represents the computation that runs either r or s non-deterministically. It is common to consider in these approa...

Non-isomorphism Invariant Borel Quantifiers

Every isomorphism invariant Borel subset of the space of structures on the natural numbers in a countable relational language is definable in Lω1ω by a theorem of Lopez-Escobar. We derive variants of this result for stabilizer subgroups of the symmetric group Sym(N) for families of relations and non-isomorphism invariant generalized quantifiers on the natural numbers such as “for all even numbe...

A Bound for Non-subgraph Isomorphism